Towards an Algorithm for Matrix Multiplier Blocks
نویسندگان
چکیده
.The basic elements of an algorithm for designing multiplier blocks for matrices are presented. The new algorithm often produces results superior to the best of the older algorithms applied only to columns.
منابع مشابه
Comparative Analysis of Sectoral Multipliers of Input-Output Model and Social Accounting Matrix
The present study is to indicate that the comparison between sectoral production multipliers of an input-output (I/O) model and a social accounting matrix (SAM) framework is almost impossible without taking into account accounting balances and theoretical considerations. Theoretically, the I/O model provides the Leontief’s production function, on the basis of which sectoral output multiplier ca...
متن کاملDesign guidelines for reconfigurable multiplier blocks
The newly proposed reconfigurable multiplier blocks offer significant savings in area over the traditional multiplier blocks for time-multiplexed digital filters or any other system where only a subset of the coefficients that can be produced by the multiplier block is needed in a given time. The basic structure comprises a multiplexer connected to at least one input of an adderhbtractor that c...
متن کاملA Recursive Block based Power Aware Imprecise Multiplier
This paper proposes a novel recursive structure block-based Wallace tree multiplier with the capability to tune its accuracy based on the precision and power requirements. The multiplier performs multiplication operations recursively from small blocks to large blocks, with a fine grain capability of turning off small blocks to trade off with power. By tuning the fidelity design “knob”, we show ...
متن کاملTrade-Offs in Multiplier Block Algorithms for Low Power Digit-Serial FIR Filters
In this paper trade-offs in digit-serial multiplier blocks are studied. Three different algorithms for realization of multiplier blocks are compared in terms of complexity and adder depth. Among the three algorithms is a new algorithm that reduces the number of shifts while the number of adders is on average the same. Hence, the total complexity is reduced for multiplier blocks implemented usin...
متن کاملA General Framework for Efficient Fpga Implementation of Matrix Product
High performance systems are required by the developers for fast processing of computationally intensive applications. Reconfigurable hardware devices in the form of FiledProgrammable Gate Arrays (FPGAs) have been proposed as viable system building blocks in the construction of high performance systems at an economical price. Given the importance and the use of matrix algorithms in scientific c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003